Solving Demodulation as an Optimization Problem
نویسندگان
چکیده
منابع مشابه
Optimization as an Analysis Tool for Human Complex Problem Solving
We present a problem class of mixed-integer nonlinear programs (MINLPs) with nonconvex continuous relaxations which stem from economic test scenarios that are used in the analysis of human complex problem solving. In a round-based scenario participants hold an executive function. A posteriori a performance indicator is calculated and correlated to personal measures such as intelligence, working...
متن کاملSuffix Stripping Problem as an Optimization Problem
Stemming or suffix stripping, an important part of the modern Information Retrieval systems, is to find the root word (stem) out of a given cluster of words. Existing algorithms targeting this problem have been developed in a haphazard manner. In this work, we model this problem as an optimization problem. An Integer Program is being developed to overcome the shortcomings of the existing approa...
متن کاملSolving Multiobjective Optimization Problem by Constraint Optimization
Multiobjective optimization problems (MOPs) have attracted intensive efforts from AI community and many multiobjective evolutionary algorithms (MOEAs) were proposed to tackle MOPs. In addition, a few researchers exploited MOEAs to solve constraint optimization problems (COPs). In this paper, we investigate how to tackle a MOP by iteratively solving a series of COPs and propose the algorithm nam...
متن کاملMetamodels as Input of an Optimization Algorithm for Solving an Inverse Eddy Current Testing Problem
A new mean of solution of eddy current testing (ECT) inverse problems is presented herein. The aim is to characterize a defect within a generic work piece by inverting an ECT signal in a short time (less than 5 s on a standard PC). The inverse problem is solved using Particle Swarm Optimization (PSO). As inputs of this algorithm, a metamodel is used in order to reduce the computation load and t...
متن کاملAn Approach for Solving Traveling Salesman Problem
In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Audio, Speech, and Language Processing
سال: 2010
ISSN: 1558-7916,1558-7924
DOI: 10.1109/tasl.2010.2041108